Analyzing a degenerate buffer with general inter-arrival and service times in discrete time

نویسندگان

  • Wouter Rogiest
  • Koenraad Laevens
  • Joris Walraevens
  • Herwig Bruneel
چکیده

In novel switching approaches such as Optical Burst Switching, the involved buffers can only provide a degenerate waiting room, with delays restricted to multiples of a basic value, the granularity. Although the resulting performance loss was already studied analytically, previous work is either limited by the assumption of independent arrivals, or it involves a matrix with size growing fast with buffer size or arrival process complexity. Overcoming this, we developed a generic and accurate loss performance model for a degenerate GI/G/1 buffer in discrete time, that yields results instantly for any constellation of burst sizes, inter-arrival times, granularity, load and buffer size. This article is a postprint of W. Rogiest, K. Laevens, J. Walraevens and H. Bruneel, Analyzing a Degenerate Buffer with General Inter-Arrival and Service Times in Discrete Time, Queueing Systems 56 Vol. 3-4 (2007), pp.203-212.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

DISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY

This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...

متن کامل

On a discrete-time GI/Geo/1/N queue with single working vacation and partial batch rejection

This paper treats a discrete-time finite buffer batch arrival queue with a single working vacation and partial batch rejection in which the inter-arrival and service times are, respectively, arbitrary and geometrically distributed. The queue is analyzed by using the supplementary variable and the imbedded Markov-chain techniques. We obtain steady-state system length distributions at prearrival,...

متن کامل

M1, M2, ..., Mk/G1, G2,..., Gk/l/N Queue with Buffer Division and Push-Out Schemes for ATM Networks (RESEARCH NOTE)

In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...

متن کامل

Queueing Models and Statistical Analysis for Atm Based Networks

In this paper a discrete-time GI/G/1 (General Independent arrivals/General service times/single server) queueing model is considered. It is useful for design and performance evaluation of asynchronous communication systems, in particular for ATM (Asynchronous Transfer Mode) systems. The model assumes an infinite waiting time room (buffer). The attention is focused on the equilibrium distributio...

متن کامل

Discrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers‎

This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Queueing Syst.

دوره 56  شماره 

صفحات  -

تاریخ انتشار 2007